Some Primality Testing Algorithms
نویسنده
چکیده
We describe the primality testing algorithms in use in some popular computer algebra systems, and give some examples where they break down in practice.
منابع مشابه
On Taking Square Roots and Constructing Quadratic Nonresidues over Finite Fields
We present a novel idea to compute square roots over some families of finite fields. Our algorithms are deterministic polynomial time and can be proved by elementary means (without assuming any unproven hypothesis). In some particular finite fields Fq, there are algorithms for taking square roots with Õ(log q) bit operations. As an application of our square root algorithms, we show a determinis...
متن کاملCyclotomy Primality Proving
Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving algorithms. By extending to elliptic curves some notions of galois theory of rings used in the cyclotomy primality tests, one obtains a new algorithm which has heurist...
متن کاملUncertainty can be Better than Certainty : Some Algorithms for Primality Testing ∗ Richard
For many years mathematicians and computer scientists have searched for a fast and reliable primality test. This is especially relevant nowadays, because the popular RSA public-key cryptosystem requires very large primes in order to generate secure keys. I will describe some efficient randomised algorithms that are useful, but have the defect of occasionally giving the wrong answer, or taking a...
متن کاملUncertainty can be Better than Certainty : Some Algorithms for Primality Testing ∗
For many years mathematicians and computer scientists have searched for a fast and reliable primality test. This is especially relevant nowadays, because the popular RSA public-key cryptosystem requires very large primes in order to generate secure keys. I will describe some efficient randomised algorithms that are useful, but have the defect of occasionally giving the wrong answer, or taking a...
متن کاملPrimality Testing and Integer Factorisation
The problem of finding the prime factors of large composite numbers has always been of mathematical interest. With the advent of public key cryptosystems it is also of practical importance, because the security of some of these cryptosystems, such as the Rivest-Shamir-Adelman (RSA) system, depends on the difficulty of factoring the public keys. In recent years the best known integer factorisati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993